A Lyndon’s identity theorem for one-relator monoids
نویسندگان
چکیده
Abstract For every one-relator monoid $$M = \langle A \mid u=v \rangle $$ M = ? A ? u v ? with $$u, v \in A^*$$ , ? ? we construct a contractible M -CW complex and use it to build projective resolution of the trivial module which is finitely generated in all dimensions. This proves that monoids are type $$\mathrm{FP}_{\infty }$$ FP ? , answering positively problem posed by Kobayashi 2000. We also apply our results classify cohomological dimension at most 2, describe relation module, sense Ivanov, torsion-free presentation as an explicitly given principal left ideal ring. In addition, prove topological analogues these showing satisfy finiteness property $$\mathrm{F}_\infty F classifying geometric 2. These give natural analogue Lyndon’s Identity Theorem for groups.
منابع مشابه
On One-relator Inverse Monoids and One-relator Groups
It is known that the word problem for one-relator groups and for one-relator monoids of the form Mon〈A ‖ w = 1〉 is decidable. However, the question of decidability of the word problem for general one-relation monoids of the form M = Mon〈A ‖ u = v〉 where u and v are arbitrary (positive) words in A remains open. The present paper is concerned with one-relator inverse monoids with a presentation o...
متن کاملDivisibility problem for one relator monoids
Theorem 1 The word problem for any 1-relator monoids can be reduced to the left side divisibility problem for monoids M presented in 2 generators by 1 defining relation of the form aU = bV . For the solution of this problem it sufficies to find an algorithm to recognize for any word aW (or for any word bW ) whether or not it is left side divisible in M by the letter b (accordingly by the letter...
متن کاملThe Word Problem for Inverse Monoids Presented by One Idempotent Relator
Birget, J.-C., SW. Margolis and J.C. Meakin, The word problem for inverse monoids presented by one idempotent relator, Theoretical Computer Science 123 (1994) 2733289. We study inverse monoids presented by a finite set of generators and one relation e= I, where e is a word representing an idempotent in the free inverse monoid, and 1 is the empty word. We show that (1) the word problem is solvab...
متن کاملDecision Problems for Inverse Monoids Presented by a Single Sparse Relator
We study a class of inverse monoids of the form M = Inv〈X |w = 1〉, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the set of words in (X ∪X) that represent the identity in M is a deterministic context free language, and that the set of geodesics in the Schützenberger graph of ...
متن کاملAutomorphisms of One-relator Groups
It is a well-known fact that every group G has a presentation of the form G = F/R, where F is a free group and R the kernel of the natural epimorphism from F onto G. Driven by the desire to obtain a similar presentation of the group of automorphisms Aut(G), we can consider the subgroup Stab(R) ⊆ Aut(F ) of those automorphisms of F that stabilize R, and try to figure out if the natural homomorph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Selecta Mathematica-new Series
سال: 2022
ISSN: ['1022-1824', '1420-9020']
DOI: https://doi.org/10.1007/s00029-022-00773-3